Parallel Fast Multipole Algorithm using MPI
نویسنده
چکیده
The simulation of many-body, many-particle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions in the force is O(N 2), where N is the number of particles in the system. The fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity of the force calculation to O(N). We implement the fast multipole algorithm, using MPI, based on optimal communication scheme which minimizes the communication and synchronization overhead. The parallel fast multipole algorithm presented here is scalable and portable.
منابع مشابه
Electromagnetics Computations Using the MPI Parallel Implementation of the Steepest Descent Fast Multipole Method (SDFMM)
The computational solution of large-scale linear systems of equations necessitates the use of fast algorithms but is also greatly enhanced by employing parallelization techniques. The objective of this work is to demonstrate the speedup achieved by the MPI (Message Passing Interface) parallel implementation of the Steepest Descent Fast Multipole Method (SDFMM). Although this algorithm has alrea...
متن کاملParallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction
Parasitic extraction techniques are used to estimate signal delay in VLSI chips. Inductance extraction is a critical component of the parasitic extraction process in which on-chip inductive effects are estimated with high accuracy. In earlier work [1], we described a parallel software package for inductance extraction called ParIS, which uses a novel preconditioned iterative method to solve the...
متن کاملProfile-based Characterization and Tuning for Subsurface Sensing and Imaging Applications
For subsurface sensing and imaging (SSI) applications, parallel computers enable massive processing of large datasets, using shared memory processing and sophisticated restoration algorithms for higher resolution images. Techniques were developed to characterize an application's serial execution and map large data sets onto Beowulf-class clusters and shared memory multiprocessor systems using M...
متن کاملEasymsg: Tools and Techniques for an Adaptive Overlapping in Spmd Programming
During the development of a parallel solver for Maxwell equations by integral formulations and Fast Multipole Method (FMM), we needed to optimize a critical part including a lot of communications and computations. Generally, many parallel programs need to communicate, but choosing explicitly the way and the instant may decrease the efficiency of the overall program. So, the overlapping of compu...
متن کاملParallel multigrid summation for the N-body problem
An Θ(n) parallel multigrid summation method for the N -body problem is presented. The method works with vacuum or periodic boundary conditions. It is based on a hierarchical decomposition of computational kernels on multiple grids. For low accuracy calculations, appropriate for molecular dynamics, a sequential implementation is faster than both Fast Multipole and Particle Mesh Ewald (PME). Its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995